Selection Algorithm Using Artificial Ant Colonies
نویسندگان
چکیده
We developed one stochastic model for intelligent selection of software components. The selection is done using a XML file containing the most relevant characteristics for each component. XML file has an extra field called "pheromone", which is a concept taken from ant colonies systems. This algorithm can be used for component, service and resource selection; this is possible because our model is general enough for been replicated with different types of requirements. Key-Words: Software Components, Selection Algorithm, Artificial Intelligence, Ant Colonies.
منابع مشابه
Optimal Truss Design Using Ant Colony Optimization
The paper presents a methodology to arrive at optimal truss designs using Ant Colony Optimization (ACO) algorithms. Ant Colony Optimization is a population-based, artificial multi-agent, general-search technique for the solution of difficult combinatorial problems with its theoretical roots based on the behavior of real ant colonies and the collective trail-laying and trail-following of its mem...
متن کاملConstruction Scheduling with Artificial Agents and the Ant Colony Optimization Metaheuristic
The research outlined in this paper aims the development of a methodology to arrive at critical path calculations in construction networks using Ant Colony Optimization (ACO) algorithms. Ant Colony Optimization is a population-based, artificial multiagent, general-search technique for the solution of difficult combinatorial problems. The method’s theoretical roots are based on the behaviour of ...
متن کاملPortfolio Optimization by Means of Meta Heuristic Algorithms
Investment decision making is one of the key issues in financial management. Selecting the appropriate tools and techniques that can make optimal portfolio is one of the main objectives of the investment world. This study tries to optimize the decision making in stock selection or the optimization of the portfolio by means of the artificial colony of honey bee algorithm. To determine the effect...
متن کاملACO Based Feature Subset Selection for Multiple k-Nearest Neighbor Classifiers
The k-nearest neighbor (k-NN) is one of the most popular algorithms used for classification in various fields of pattern recognition & data mining problems. In k-nearest neighbor classification, the result of a new instance query is classified based on the majority of k-nearest neighbors. Recently researchers have begun paying attention to combining a set of individual k-NN classifiers, each us...
متن کاملAnt colony optimization: Introduction and recent trends
Ant colony optimization is a technique for optimization that was introduced in the early 1990’s. The inspiring source of ant colony optimization is the foraging behavior of real ant colonies. This behavior is exploited in artificial ant colonies for the search of approximate solutions to discrete optimization problems, to continuous optimization problems, and to important problems in telecommun...
متن کامل